Managing and Deploying Pervasive Wireless Internet Access through Attractive Connection Sharing and Reselling Mechanisms Pasquale PACE and Gianluca ALOI On Nonnegative Signed Domination in Graphs and its Algorithmic Complexity
نویسندگان
چکیده
In order to provide ubiquitous access for the users, future generation network integrate a multitude of radio access technologies (RAT’S) which can interoperate between them. However, the most challenging problem is the selection of an optimal radio access network, in terms of quality of service anywhere at anytime. This paper proposes a novel ranking algorithm, which combines multi attribute decision making (MADM) and Mahalanobis distance. Firstly, a classification method is applied to build a classes which having the homogeneous criteria. Afterwards, the Fuzzy AHP, MADM method is applied to determine weights of inter-classes and intraclasses. Finally, Mahalanobis distance is used to rank the alternatives. The simulation results show that the proposed algorithm can effectively reduce the ranking abnormality and the number of handoffs.
منابع مشابه
Managing and Deploying Pervasive Wireless Internet Access through Attractive Connection Sharing and Reselling Mechanisms
Nowadays Internet has become a critical part of our daily lives and an affordable Internet access is a leading engine of economic, cultural, social and political growth. In our opinion, cooperation among customers could give a boost to Internet availability and affordability, therefore, we propose an attractive and efficient pricing mechanism to give incentives to wireless users who decide to s...
متن کاملNonnegative signed total Roman domination in graphs
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N(v)}f(x)ge 0$ for each $vin V(G)$, where $N(v)$ is the open neighborhood of $v$, and (ii) every vertex $u$ for which $f(u...
متن کاملOn Nonnegative Signed Domination in Graphs and its Algorithmic Complexity
Let G = (V, E) be a simple graph with vertex set V and edge set E. A function f from V to a set {-1, 1} is said to be a nonnegative signed dominating function (NNSDF) if the sum of its function values over any closed neighborhood is at least zero. The weight of f is the sum of function values of vertices in V. The nonnegative signed domination number for a graph G equals the minimum weight of a...
متن کاملWeak signed Roman domination in graphs
A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...
متن کاملWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کامل